Infinite Words and Confluent Rewriting Systems: Endomorphism Extensions
نویسندگان
چکیده
Infinite words over a finite special confluent rewriting system R are considered and endowed with natural algebraic and topological structures. Their geometric significance is explored in the context of Gromov hyperbolic spaces. Given an endomorphism φ of the monoid generated by R, existence and uniqueness of several types of extensions of φ to infinite words (endomorphism extensions, weak endomorphism extensions, continuous extensions) are discussed. Characterization theorems and positive decidability results are proved for most cases.
منابع مشابه
Solving Word Problems in Group Extensions over Infinite Words
In my lecture I report on a joint work with Alexei G. Myasnikov. Non-Archimedean words have been introduced as a new type of infinite words which can be investigated through classical methods in combinatorics on words due to a length function. The length function, however, takes values in the additive group of polynomials Z[t] (and not, as traditionally, in N), which yields various new properti...
متن کاملReduction Operators: Rewriting Properties and Completion
We propose an approach on linear rewriting where applications of rewriting rules are replaced by applications of specific linear maps called reduction operators. These operators were introduced by Berger for finite dimensional vector spaces. His motivation was to study the homology of a special class of algebras called finitely generated homogeneous algebras. The elements of these algebras are ...
متن کاملAn Algebraic Approach of Confluence and Completion
We propose an approach on linear rewriting where applications of rewrite rules are replaced by applications of specific linear maps called reduction operators. These operators were introduced by Berger for finite dimensional vector spaces. His motivation was to study the homology of a special class of algebras called finitely generated homogeneous algebras. The elements of these algebras are no...
متن کاملEntropy of infinite systems and transformations
The Kolmogorov-Sinai entropy is a far reaching dynamical generalization of Shannon entropy of information systems. This entropy works perfectly for probability measure preserving (p.m.p.) transformations. However, it is not useful when there is no finite invariant measure. There are certain successful extensions of the notion of entropy to infinite measure spaces, or transformations with ...
متن کاملOn Monoids Presented by Rewriting Systems and Automatic Structures for Their Submonoids
Generalizing results of Otto & Ruškuc, this paper shows that every finitely generated submonoid of a monoid presented by a confluent finite special rewriting system admits an automatic structure that is simultaneously rr-, `r-, r`-, and ``-automatic; and that every finitely generated submonoid of a monoid presented by a confluent regular monadic rewriting system admits an automatic structure th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJAC
دوره 19 شماره
صفحات -
تاریخ انتشار 2009